recursive subprogram

См. также в других словарях:

• recursive subprogram — or recursive subroutine noun (computing) One which includes among its program statements a call to the subprogram itself • • • Main Entry: ↑recur …   Useful english dictionary

• recursive subroutine — recursive subprogram or recursive subroutine noun (computing) One which includes among its program statements a call to the subprogram itself • • • Main Entry: ↑recur …   Useful english dictionary

• recursive routine — noun a routine that can call itself • Hypernyms: ↑routine, ↑subroutine, ↑subprogram, ↑procedure, ↑function …   Useful english dictionary

• subprogram — noun a set sequence of steps, part of larger computer program • Syn: ↑routine, ↑subroutine, ↑procedure, ↑function • Derivationally related forms: ↑procedural (for: ↑procedure) …   Useful english dictionary

• Subroutine — In computer science, a subroutine (function, method, procedure, or subprogram) is a portion of code within a larger program, which performs a specific task and can be relatively independent of the remaining code. The syntax of many programming… …   Wikipedia

• computer programming language — Introduction       any of various languages for expressing a set of detailed instructions for a digital computer. Such instructions can be executed directly when they are in the computer manufacturer specific numerical form known as machine… …   Universalium

• Fortran language features — This is a comprehensive overview of features of the Fortran 95 language, the version supported by almost all existing Fortran compilers. Old features that have been superseded by new ones are not described few of those historic features are used… …   Wikipedia

• Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

• Lambda calculus — In mathematical logic and computer science, lambda calculus, also written as λ calculus, is a formal system designed to investigate function definition, function application and recursion. It was introduced by Alonzo Church and Stephen Cole… …   Wikipedia

• Generic programming — is a style of computer programming in which algorithms are written in terms of to be specified later types that are then instantiated when needed for specific types provided as parameters and was pioneered by Ada which appeared in 1983. This… …   Wikipedia

• Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… …   Wikipedia